application of imperialist competitive algorithm to optimization problems arising in welding process
نویسندگان
چکیده
the imperialist competitive algorithm (ica) that was recently introduced has shown its good performance in optimization problems. this algorithm is inspired by competition mechanism among imperialists and colonies, in contrast to evolutionary algorithms. this paper presents optimization of bead geometry in welding process using of ica. therefore, two case studies from literature are presented to show the effectiveness of the proposed algorithm . ica has demonstrated excellent capabilities such as simplicity, accuracy, faster convergence and better global optimum achievement. the results of ica were finally compared with the genetic algorithm (ga). the outcome shows the success of ica in optimizing the weld bead geometry.
منابع مشابه
OPTIMIZATION TO IDENTIFY MUSKINGUM MODEL PARAMETERS USING IMPERIALIST COMPETITIVE ALGORITHM
In engineering, flood routing is an important technique necessary for the solution of a floodcontrol problem and for the satisfactory operation of a flood-prediction service. A simple conceptual model like the Muskingum model is very effective for the flood routing process. One challenge in application of the Muskingum model is that its parameters cannot be measured physically. In this article ...
متن کاملUsing Imperialist competitive algorithm optimization in multi-response nonlinear programming
The quality of manufactured products is characterized by many controllable quality factors. These factors should be optimized to reach high quality products. In this paper we try to find the controllable factors levels with minimum deviation from the target and with a least variation. To solve the problem a simple aggregation function is used to aggregate the multiple responses functions then a...
متن کاملOptimization of Fabric Layout by Using Imperialist Competitive Algorithm
In textile industry, marker planning is one of the main operations in the cutting fabric stage. Marker packing is usually used to maximize cloth exploitation and minimize its waste. In this research, a method is used based on new found meta-heuristic imperialist competitive algorithm (ICA) and Bottom-Left-Fill Algorithm (BLF) to achieve optimal marker packing. Function of the proposed method wa...
متن کاملUsing Imperialist Competitive Algorithm in Optimization of Nonlinear Multiple Responses
The quality of manufactured products is characterized by many controllable quality factors. These factors should be optimized to reach high quality products. In this paper we try to find the controllable factor’s levels with minimum deviation from their target and with a least variation. To solve such problems a simple aggregation function is used to aggregate the multiple response functions fo...
متن کاملMOEICA: Enhanced multi-objective optimization based on imperialist competitive algorithm
In this paper, a multi-objective enhanced imperialist competitive algorithm (MOEICA) is presented. The main structures of the original ICA are employed while some novel approaches are also developed. Other than the non-dominated sorting and crowding distance methods which are used as the main tools for comparing and ranking solutions, an auxiliary comparison approach called fuzzy possession is ...
متن کاملSolving the Constrained Nonlinear Optimization based on Imperialist Competitive Algorithm
In this work a strong framework is presented for solving the constrained nonlinear optimization problem that is a relatively complicated problem. These problems arise in a diverse range of sciences. There are a number of different approaches have been proposed. In this work, we employ the imperialist competitive algorithm (ICA) for solving constrained nonlinear optimization problems. Some well-...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
international journal of advanced design and manufacturing technologyجلد ۷، شماره ۳، صفحات ۶۵-۷۲
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023